#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<malloc.h>

struct student{
    char username[100];
    char password[100];  
    struct student *next;
}student;

node *insertuname(node *top,char *username[])
{
node *new = (node *)malloc(sizeof(node));
strcpy(new->username,username);
new->next=NULL;
return stins(top,new)
}


node *insertpass(node *top,char *password[])
{
node *new =(node *)malloc(sizeof(node));
strcpy(new->password,password);
new->next=NULL;
return stins(top,new)
}

node *stins(node *top,node *insert){
if(top== NULL) 
return insert;
node *temp=top;
while(top->next != NULL)
{top=head->next;}
top->next=insert;
return temp;
}


struct student st;






void hashfn1(int *username[])
{
int l,pos;
l=strlen(username);
for(i=0; i<l; i++)
pos=len*113
}


void hashfn2(int *username[])
{
int l,pos;
l=strlen(username);
for(i=0; i<l; i++)
pos=(len%113)*221

}

void probing()
{
}

void hashfn3(int *username[])
{
int l,pos;
l=strlen(username);
for(i=0; i<l; i++)
pos=(len+113)*31
}

int main()
{
char a[] = "namepass.txt";
read(a);
return 0;
}


void read(char a[])
{
int len;
char c;   
FILE *f,*f1;   
f=fopen(a,"r");
c=getc(f);
do{
if(m='\n')
len++;
c=getc(f)
}while(!EOF);
}
 			
	          



int main()
{
char a[] = "namepass.txt";
int n;
read(a);
printf("Hashing function 1.Hashfunction1/2.Hashfunction2/3.Hashfunction3/4.Quit\n");
scanf("%d",&n);
do
{
printf("Enter username:\n ");
scanf("%s",username);
printf("Enter password: \n");
scanf("%s",password);
}while(k<3);
		printf("\nAccess denied too many tries\n");

return 0;
}


